Non-interference proof techniques for the analysis of cryptographic protocols

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Non-interference proof techniques for the analysis of cryptographic protocols

Non-interference has been advocated by various authors as a uniform framework for the formal specification of security properties in cryptographic protocols. Unfortunately, specifications based on non-interference are often non-effective, as they require protocol analyses in the presence of all possible intruders. This paper develops new characterizations of non-interference that rely on a fini...

متن کامل

Proof Techniques for Cryptographic Processes

Contextual equivalences for cryptographic process calculi, like the spi-calculus, can be used to reason about correctness of protocols, but their definition suffers from quantification over all possible contexts. Here, we focus on two such equivalences, namely may-testing and barbed equivalence, and investigate tractable proof methods for them. To this aim, we design an enriched labelled transi...

متن کامل

Bisimulation-based non-deterministic admissible interference and its application to the analysis of cryptographic protocols

In this paper, we first define bisimulation-based non-deterministic admissible interference (BNAI), derive its process-theoretic characterisation and present a compositional verification method with respect to the main operators over communicating processes, generalising in this way the similar trace-based results obtained [J. Univ. Comput. Sci. 6 (2000) 1054] into the finer notion of observati...

متن کامل

Extending Formal Cryptographic Protocol Analysis Techniques for Group Protocols and Low-Level Cryptographic Primitives

We have recently seen the development of a number of new tools for the analysis of cryptographic protocols. Many of them are based on state exploration, that is, they try to find as many paths through the protocol as possible, in the hope that, if there is an error, it will be discovered. But, since the search space offered by a cryptographic protocol is infinite, this search alone cannot guara...

متن کامل

Classiication of Cryptographic Techniques in Authentication Protocols

In many published authentication protocols, the cryptographic services are coarsely speciied in that, whenever needed, a uniform notation is used to denote them while the exact nature of protection required is left unclear. In this paper we reason that such a coarse treatment not only forms a foundation why authentication protocols are error prone, but is also responsible for a typical feature ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computer Security

سال: 2005

ISSN: 1875-8924,0926-227X

DOI: 10.3233/jcs-2005-13104